12 research outputs found
On Graph Refutation for Relational Inclusions
We introduce a graphical refutation calculus for relational inclusions: it
reduces establishing a relational inclusion to establishing that a graph
constructed from it has empty extension. This sound and complete calculus is
conceptually simpler and easier to use than the usual ones.Comment: In Proceedings LSFA 2011, arXiv:1203.542
On Graphical Calculi for Modal Logics
We present a graphical approach to classical and intuitionistic modal logics, which provides uniform formalisms for expressing, analysing and comparing their semantics. This approach uses the flexibility of graphical calculi to express directly and intuitively the semantics for modal logics. We illustrate the benefits of these ideas by applying them to some familiar cases of classical and intuitionistic multi-modal logics.Cálculos Gráficos para lógicas modais
Apresentamos uma abordagem gráfica para as lógicas modais clássica e intuicionista, capaz de fornecer formalismos uniformes para expressar, analisar e comparar suas respectivas semânticas. Tal abordagem utiliza a flexibilidade dos cálculos gráficos para expressar, direta e intuitivamente, a semântica das lógicas modais. Ilustramos os benefícios dessas ideias aplicando-as a alguns casos conhecidos de lógicas multimodais clássica e intuicionista.---Artigo em inglês
On Graphical Calculi for Modal Logics
We present a graphical approach to classical and intuitionistic modal logics, which provides uniform formalisms for expressing, analysing and comparing their semantics. This approach uses the flexibility of graphical calculi to express directly and intuitively the semantics for modal logics. We illustrate the benefits of these ideas by applying them to some familiar cases of classical and intuitionistic multi-modal logics
Labeled Families in Modular Software Development
We present a general framework for the modular development of families of programs or specifications through the use of labels. Families, consisting of components or versions, appear naturally in software development. The concept of implementation, as an interpretation into a conservative extension, is generalized to labeled families of specifications and formulated in categorical terms. We also show that the category of such families has pushouts and that this construction preserves conservative extensions, as required for composing implementations
A Graph Calculus for Predicate Logic
We introduce a refutation graph calculus for classical first-order predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension, i. e. it represents bottom. Our calculus establishes that a graph has empty extension by converting it to a normal form, which is expanded to other graphs until we can recognize conflicting situations (equivalent to a formula and its negation)